Traveling Salesman Problem with Optional Bonus Collection, Pickup Time and Passengers

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The pickup and delivery traveling salesman problem with handling costs

This paper introduces the pickup and delivery traveling salesman problem with handling costs (PDTSPH). In the PDTSPH, a single vehicle has to transport loads from origins to destinations. Loading and unloading of the vehicle is operated in a last-in-firstout (LIFO) fashion. However, if a load must be unloaded that was not loaded last, additional handling operations are allowed to unload and rel...

متن کامل

A heuristic for the pickup and delivery traveling salesman problem

This paper deals with the pickup and delivery traveling salesman problem. First we show how to adapt some classical traveling salesman heuristics to solve this problem, then we propose a new and e$cient composite heuristic. The proposed heuristic is composed of two phases: a solution construction phase including a local optimization component and a deletion and re-insertion improvement phase. T...

متن کامل

Perturbation heuristics for the pickup and delivery traveling salesman problem

The Traveling Salesman Problem with Pickup and Delivery (PDTSP) is considered. Seven perturbation heuristics are applied to instances ranging from 51 to 443 vertices. The main point of perturbation heuristics is to help a local search process to move away from a local optimum. The seven heuristics fall into three categories: Instance Perturbation (IP), Algorithmic Perturbation (AP), and Solutio...

متن کامل

The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm

The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. The problem consists of determining a minimum cost tour such that each pickup vertex is visited before its corresponding delivery vertex. In this paper, the TSPPD is modeled as an integer linear program and its polyhed...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Revista de Informática Teórica e Aplicada

سال: 2020

ISSN: 2175-2745,0103-4308

DOI: 10.22456/2175-2745.93733